SROIQ Syntax Approximation by Using Nominal Schemas
نویسندگان
چکیده
Nominal schemas is a recently introduced extension of description logics which makes it possible to express rules which generalize DL-safe ones. A tractable description logic, ELROVn, has been identified. This leads us to the question: can we improve approximate reasoning results by employing nominal schemas? In this paper, we investigate how to approximately cast SROIQ into ELROVn. Using a datalog-based tractable algorithm, a preliminary evaluation shows that our approach can indeed do approximate SROIQ-reasoning with a high recall.
منابع مشابه
Nominal Schemas for Integrating Rules and Description Logics
We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rules in description logic syntax. We show that adding nominal schemas to SROIQ does not increase its worst-case reasoning complexity, and we identify a family of tractable DLs SROELVn that allow for restricted use of nominal...
متن کاملNominal Schemas in Description Logics: Complexities Clarified
Nominal schemas extend description logics (DLs) with a restricted form of variables, thus integrating rule-like expressive power into standard DLs. They are also one of the most recently introduced DL features, and in spite of many works on algorithms and implementations, almost nothing is known about their computational complexity and expressivity. We close this gap by providing a comprehensiv...
متن کاملComplexities of Nominal Schemas
In this extended abstract, we review our recent work “Nominal Schemas in Description Logics: Complexities Clarified” [6], to be presented at KR 2014. The fruitful integration of reasoning on both schema and instance level poses a continued challenge to knowledge representation and reasoning. While description logics (DLs) excel at the former task, rule-based formalisms are often more adequate f...
متن کاملReconciling OWL and Rules
We report on a recent advance in integrating Rules and OWL. We discuss a recent proposal, known as nominal schemas, which realizes a seamless integration of Datalog rules into the description logic SROIQ which underlies OWL 2 DL. We present extensions of the standardized OWL syntaxes to incorporate nominal schemas, reasoning algorithms, and a first naive implementation. And we argue why this ap...
متن کاملNonmonotonic Nominal Schemas Revisited
Recently, a very general description logic (DL) that extends SROIQ (the DL underlying OWL 2 DL) at the same time with nominal schemas and epistemic modal operators has been proposed, which encompasses some of the most prominent monotonic and non-monotonic rule languages, including Datalog under the answer set semantics. A decidable fragment is also presented, but the restricted language does no...
متن کامل